Description: 哲学家进餐问题，进程是独立参与分配资源的最小单位，在有线程的OS中，线程是运行的最小单位，
课堂所述进程之间的同步与互斥，实际上是属于不同进程的线程间的同步与互斥，当
然，属于同一进程的不同线程一样存在同步与互斥，其控制同步与互斥的原理跟进程
是一样的-dining philosophers problem, the process is independent participation in the allocation of resources as the smallest unit, in the OS thread, thread is the smallest unit of operation, the process described in the classroom between the synchronization and mutual exclusion. actually belong to different threads in the process of synchronization and mutual exclusion, of course, the same process there is a different thread synchronization and mutual exclusion, control and coordinate the process with the principle of the same Platform: |
Size: 980 |
Author:李明 |
Hits:
Description: 这是个操作系统中,多线称关于哲学家就餐问题的演示程序!-This is the demo program for the multithread about philosophers having dinner problem in the operating system! Platform: |
Size: 123904 |
Author:张军 |
Hits:
Description: 哲学家就餐问题，本人已经在网上找了很久啦，希望能和大家分享-dining philosophers problem, I have to find on the Internet-- for a long time, and we hope to share Platform: |
Size: 3072 |
Author:ken |
Hits:
Description: 哲学家进餐问题，进程是独立参与分配资源的最小单位，在有线程的OS中，线程是运行的最小单位，
课堂所述进程之间的同步与互斥，实际上是属于不同进程的线程间的同步与互斥，当
然，属于同一进程的不同线程一样存在同步与互斥，其控制同步与互斥的原理跟进程
是一样的-dining philosophers problem, the process is independent participation in the allocation of resources as the smallest unit, in the OS thread, thread is the smallest unit of operation, the process described in the classroom between the synchronization and mutual exclusion. actually belong to different threads in the process of synchronization and mutual exclusion, of course, the same process there is a different thread synchronization and mutual exclusion, control and coordinate the process with the principle of the same Platform: |
Size: 1024 |
Author:李明 |
Hits:
Description: 哲学家就餐问题，显示线程的关系，采用信号量产生互斥的功能-Dining philosophers problem, show the relationship between threads, using semaphore have mutually exclusive features Platform: |
Size: 11264 |
Author:孟小磊 |
Hits:
Description: 哲学家进餐问题，经典的同步问题，是初学者很好的学习材料-Dining philosophers problem, the classical synchronization problem is a very good learning materials for beginners Platform: |
Size: 2536448 |
Author:linweiyong |
Hits:
Description: 模拟哲学家进餐的同步问题，实现一个既没有两邻座同时吃饭，又没有人饿死（永远拿不到一双筷子）的算法-Simulation of synchronous dining philosophers problem, the realization of a neighbor at the same time do not have two meals, and no one starved to death (never get a pair of chopsticks) algorithm Platform: |
Size: 1010688 |
Author:梁先生 |
Hits:
Description: 本程序是在Linux下面 实现了哲学家就餐问题。其中演示了会发生死锁和不会发生死锁的情况。-This program is implemented in the Linux following the Dining Philosophers Problem. Which demonstrates the deadlock and does not happen will happen deadlock situation. Platform: |
Size: 2048 |
Author:文锋 |
Hits:
Description: 哲学家就餐问题 实现5个哲学家5支筷子的就餐问题涉及到AND型信号量，线程的阻塞唤醒切换功能-Dining philosophers problem to achieve five dining philosophers five chopsticks issues related to the AND-type semaphore, blocking thread switching wake Platform: |
Size: 3072 |
Author:陈蓝 |
Hits:
Description: 基于实例来说明嵌入式系统及语言学习的总结、概括，内涵一些详细例子的代码。-Dining philosophers and the second half of 2006, embedded system designers afternoon answer questions Platform: |
Size: 668672 |
Author:王锋 |
Hits:
Description: 操作系统之哲学家就餐问题的算法实现，利用java开发语言-The operating system of the dining philosophers problem algorithm Platform: |
Size: 3072 |
Author:hanziwen |
Hits:
Description: 哲学家就餐问题是一道十分经典的进程同步问题。该道题旨在解决当资源有限时（可能产生死锁），如何有效地避免死锁的问题。本实验选取“and”型信号量的解决办法，只有当哲学家具备同时拿到左右两只筷子的能力时，才能吃饭。否则，若则学家只能能够拿到一只筷子时，他只能放弃这只筷子，供其他可能需要这只筷子的哲学家使用。这样，只有哲学家左右两人均不进食时，该哲学家才有吃饭的权利。采取这种方法可以有效地避免死锁的产生。-The dining philosophers problem is a very classic process synchronization problem. This question is designed to address the problem (which may produce deadlock) when resources are limited, how to avoid deadlocks. In our study, " and" type signal amount of solution only when philosophers have the ability to get around two chopsticks to eat. Otherwise, if the scientist can only be able to get a chopsticks, he can only be waived only chopsticks for the other may need to use only chopsticks philosopher. In this way, only philosophers around two people are not eating, the philosopher have the right to eat. Adopt this method can effectively avoid the generation of deadlock. Platform: |
Size: 9717760 |
Author: |
Hits:
Description: 操作系统中，如何实现哲学家进餐这一经典问题的电子书，适合于操作系统的辅助教学-Operating system, how to achieve the classic dining philosophers problem book, suitable for operating system-aided teaching Platform: |
Size: 117760 |
Author:庄翔 |
Hits:
Search - dining philosophers